Sparsity considerations for dependent observations

The aim of this paper is to provide a comprehensive introduction for the study of L1-penalized estimators in the context of dependent observations. We define a general $\ell_{1}$-penalized estimator for solving problems of stochastic optimization. This estimator turns out to be the LASSO in the regression estimation setting. Powerful theoretical guarantees on the statistical performances of the LASSO were provided in recent papers, however, they usually only deal with the iid case. Here, we study our estimator under various dependence assumptions

An invariance principle for weakly dependent stationary general models

The aim of this article is to refine a weak invariance principle for stationary sequences given by Doukhan & Louhichi (1999). Since our conditions are not causal our assumptions need to be stronger than the mixing and causal $\theta$-weak dependence assumptions used in Dedecker & Doukhan (2003). Here, if moments of order $>2$ exist, a weak invariance principle and convergence rates in the CLT are obtained; Doukhan & Louhichi (1999) assumed the existence of moments with order $>4$. Besides the previously used $\eta$- and $\kappa$-weak dependence conditions, we introduce a weaker one, $\lambda$, which fits the Bernoulli shifts with dependent inputs.Comment: 30 page

Non-parametric estimation of time varying AR(1)--processes with local stationarity and periodicity

Extending the ideas of [7], this paper aims at providing a kernel based non-parametric estimation of a new class of time varying AR(1) processes (Xt), with local stationarity and periodic features (with a known period T), inducing the definition Xt = at(t/nT)X t--1 + $\xi$t for t $\in$ N and with a t+T $\not\equiv$ at. Central limit theorems are established for kernel estima-tors as(u) reaching classical minimax rates and only requiring low order moment conditions of the white noise ($\xi$t)t up to the second order

The notion of ψ\psi-weak dependence and its applications to bootstrapping time series

We give an introduction to a notion of weak dependence which is more general than mixing and allows to treat for example processes driven by discrete innovations as they appear with time series bootstrap. As a typical example, we analyze autoregressive processes and their bootstrap analogues in detail and show how weak dependence can be easily derived from a contraction property of the process. Furthermore, we provide an overview of classes of processes possessing the property of weak dependence and describe important probabilistic results under such an assumption.Comment: Published in at http://dx.doi.org/10.1214/06-PS086 the Probability Surveys (http://www.i-journals.org/ps/) by the Institute of Mathematical Statistics (http://www.imstat.org

Phantom distribution functions for some stationary sequences

The notion of a phantom distribution function (phdf) was introduced by O'Brien (1987). We show that the existence of a phdf is a quite common phenomenon for stationary weakly dependent sequences. It is proved that any $\alpha$-mixing stationary sequence with continuous marginals admits a continuous phdf. Sufficient conditions are given for stationary sequences exhibiting weak dependence, what allows the use of attractive models beyond mixing. The case of discontinuous marginals is also discussed for $\alpha$-mixing. Special attention is paid to examples of processes which admit a continuous phantom distribution function while their extremal index is zero. We show that Asmussen (1998) and Roberts et al. (2006) provide natural examples of such processes. We also construct a non-ergodic stationary process of this type

Rates of convergence in the strong invariance principle under projective criteria

We give rates of convergence in the strong invariance principle for stationary sequences satisfying some projective criteria. The conditions are expressed in terms of conditional expectations of partial sums of the initial sequence. Our results apply to a large variety of examples, including mixing processes of different kinds. We present some applications to symmetric random walks on the circle, to functions of dependent sequences, and to a reversible Markov chain